全文获取类型
收费全文 | 2491篇 |
免费 | 134篇 |
国内免费 | 240篇 |
专业分类
化学 | 16篇 |
力学 | 80篇 |
综合类 | 45篇 |
数学 | 2637篇 |
物理学 | 87篇 |
出版年
2023年 | 13篇 |
2022年 | 10篇 |
2021年 | 26篇 |
2020年 | 31篇 |
2019年 | 46篇 |
2018年 | 41篇 |
2017年 | 65篇 |
2016年 | 69篇 |
2015年 | 55篇 |
2014年 | 90篇 |
2013年 | 122篇 |
2012年 | 126篇 |
2011年 | 86篇 |
2010年 | 80篇 |
2009年 | 127篇 |
2008年 | 130篇 |
2007年 | 161篇 |
2006年 | 156篇 |
2005年 | 138篇 |
2004年 | 129篇 |
2003年 | 114篇 |
2002年 | 115篇 |
2001年 | 101篇 |
2000年 | 134篇 |
1999年 | 91篇 |
1998年 | 99篇 |
1997年 | 104篇 |
1996年 | 53篇 |
1995年 | 44篇 |
1994年 | 41篇 |
1993年 | 39篇 |
1992年 | 28篇 |
1991年 | 25篇 |
1990年 | 23篇 |
1989年 | 10篇 |
1988年 | 16篇 |
1987年 | 12篇 |
1986年 | 7篇 |
1985年 | 14篇 |
1984年 | 14篇 |
1983年 | 4篇 |
1982年 | 11篇 |
1981年 | 13篇 |
1980年 | 9篇 |
1979年 | 9篇 |
1978年 | 10篇 |
1977年 | 9篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 6篇 |
排序方式: 共有2865条查询结果,搜索用时 375 毫秒
21.
Browder-Petryshyn 型的严格伪压缩映射的粘滞迭代逼近方法 总被引:1,自引:0,他引:1
主要研究Browder-Petryshyn型的严格伪压缩映射的粘滞迭代逼近过程,证明了Browder-Petryshyn型的严格伪压缩映射的不动点集F(T)是闭凸集.在q-一致光滑且一致凸的Banach空间中,对于严格伪压缩映射T,利用徐洪坤在2004年引进的粘滞迭代得到的序列弱收敛于T的某个不动点.同时证明了Hilbert空间中Browder-Petryshyn型的严格伪压缩映射的相应迭代序列强收敛到T的某个不动点,其结果推广与改进了徐洪坤2004年的相应结果. 相似文献
22.
Liang-gen Hu 《应用数学学报(英文版)》2007,23(2):281-288
In this paper,we will establish several strong convergence theorems for the approximation ofcommon fixed points of r-strictly asymptotically pseudocontractive mappings in uniformly convex Banachspaces using the modiied implicit iteration sequence with errors,and prove the necessary and sufficient conditionsfor the convergence of the sequence.Our results generalize,extend and improve the recent work,in thistopic. 相似文献
23.
In this paper, we review and unify some classes of generalized convex functions introduced by different authors to prove minimax results in infinite-dimensional spaces and show the relations between these classes. We list also for the most general class already introduced by Jeyakumar (Ref. 1) an elementary proof of a minimax result. The proof of this result uses only a finite-dimensional separa- tion theorem; although this minimax result was already presented by Neumann (Ref. 2) and independently by Jeyakumar (Ref. 1), we believe that the present proof is shorter and more transparent. 相似文献
24.
Consider a portfolio containing heterogeneous risks. The premiums of the policyholders might not cover the amount of the payments which an insurance company pays the policyholders. When setting the premium, this risk has to be taken into consideration. On the other hand the premium that the insured pays has to be fair. This fairness is measured by a function of the difference between the risk and the premium paid—we call this function a distance function. For a given small probability of insolvency, we find the premium for each class, such that the distance function is minimized. Next we formulate and solve the dual problem, which is minimizing the insolvency probability under the constraint that the distance function does not exceed a given level. This paper generalizes a previous paper [Zaks, Y., Frostig, E., Levikson, B., 2006. Optimal pricing of a heterogeneous portfolio for a given risk level. Astin Bull. 36 (1), 161–185] where only a square distance function was considered. 相似文献
25.
The objective of this paper is to analyze under what well-known operations the class of quasipolyhedral convex functions,
which can be regarded as an extension of that of polyhedral convex functions, is closed. The operations that will be considered
are those that preserve polyhedral convexity, such that the image and the inverse image under linear transformations, right
scalar multiplication (including the case where λ=0+) and pointwise addition.
相似文献
26.
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation. 相似文献
27.
This paper develops a theory for the global solution of nonconvex optimization problems with parameter-embedded linear dynamic systems. A quite general problem formulation is introduced and a solution is shown to exists. A convexity theory for integrals is then developed to construct convex relaxations for utilization in a branch-and-bound framework to calculate a global minimum. Interval analysis is employed to generate bounds on the state variables implied by the bounds on the embedded parameters. These bounds, along with basic integration theory, are used to prove convergence of the branch-and-bound algorithm to the global minimum of the optimization problem. The implementation of the algorithm is then considered and several numerical case studies are examined thoroughly 相似文献
28.
29.
§ 1. Introduction Anecessaryandsufficientconditionandasufficientconditiontoensurethataset valuedmappingandasingle valuedmappinginacompletemetricspaceandacompleteconvexmetricspacehavingacommonfixedpointarerespectivelygivenin [1 ] .Meanwhilethemainresultsin[2 ]— [5]areimprovedandextendedin [1 ] .Inthispaper ,theexistenceatcommonfixedpointsoftwoset valuedmappingandasing valuedmappingwerestudied ,andthecorrespond ingresultsin [1 ]— [5]wereextendedandimproved .Let(X ,d)beanon emptymetricspa… 相似文献
30.
几何凸函数与琴生型不等式 总被引:20,自引:3,他引:17
吴善和 《数学的实践与认识》2004,34(2):155-163
给出几何凸函数的定义以及判定几何凸函数的方法 ,建立关于几何凸函数的琴生型不等式 ,最后给出它的应用 ,包括改进一些已知不等式和建立一些新不等式 . 相似文献